The Communi ative Multiagent Team De ision Problem :

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...

Termination of Constraint Contextual Rewriting

Abstra t. The e e tive integration of de ision pro edures in formula simpli ation is a fundamental problem in me hani al veri ation. The main sour e of diÆ ulty o urs when the de ision pro edure is asked to solve goals ontaining symbols whi h are interpreted for the prover but uninterpreted for the de ision pro edure. To ope with the problem, Boyer & Moore proposed a te hnique, alled augmentati...

A Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem

Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...

Counting Complexity Classes

Shripad Thite May 11, 1998 Abstra t The ounting omplexity lasses are de ned in terms of the number of a epting omputation paths of nondetereministi polynomial-time Turing ma hines. They are, therefore, the ounting versions of de ision problems in NP. We review the properties of well-known ounting lasses like #P, P, GapP, SPP et . We also give an overview of the proof of Toda's theorem that rela...

Sizes of de ision tables and de ision trees